ABSTRACT
Historically, there are many options to improve image quality that are each derived from the same raw ultrasound sensor data. However, none of these historical options combine multiple contributions in a single image formation step. This invited contribution discusses novel alternatives to beamforming raw ultrasound sensor data to improve image quality, delivery speed, and feature detection after learning from the physics of sound wave propagation. Applications include cyst detection, coherence-based beamforming, and COVID-19 feature detection. A new resource for the entire community to standardize and accelerate research at the intersection of ultrasound beamforming and deep learning is summarized (https://cubdl.jhu.edu). The connection to optics with the integration of ultrasound hardware and software is also discussed from the perspective of photoacoustic source detection, reflection artifact removal, and resolution i mprovements. These innovations demonstrate outstanding potential to combine multiple outputs and benefits in a single signal processing step with the assistance of deep learning. © 2022 SPIE.
ABSTRACT
In the era of big data, standard analysis tools may be inadequate for making inference and there is a growing need for more efficient and innovative ways to collect, process, analyze and interpret the massive and complex data. We provide an overview of challenges in big data problems and describe how innovative analytical methods, machine learning tools and metaheuristics can tackle general healthcare problems with a focus on the current pandemic. In particular, we give applications of modern digital technology, statistical methods,data platforms and data integration systems to improve diagnosis and treatment of diseases in clinical research and novel epidemiologic tools to tackle infection source problems, such as finding Patient Zero in the spread of epidemics. We make the case that analyzing and interpreting big data is a very challenging task that requires a multi-disciplinary effort to continuously create more effective methodologies and powerful tools to transfer data information into knowledge that enables informed decision making.
ABSTRACT
The topic of source identification has attracted wide attention from researchers. In practice, the source identification method aims to locate the sources of rumors, computer viruses, and epidemics, such as COVID-19. However, there are two main problems with existing propagation source detection methods. First, most source detection methods are based on infinite networks, not in line with reality. Second, sources are often randomly selected in simulations, but different sources often cause significantly different detection results in real-world applications. To this end, we study how does the source location impact the effectiveness of source detection in finite networks. This paper first proposes a diameter-based node division method to classify the nodes based on their structural location. We further offer different evaluation indicators to measure the effectiveness of source detection methods. Then, we conduct systematic experiments on three synthetic networks and two real-world networks. Our experiments demonstrate that the location of the source directly effects detection effectiveness in finite networks for all source detection methods. Specifically, sources closer to the network boundary will lead to worse detection performance. It means that attackers can choose sources close to the network boundary to reduce the probability of detection to achieve a larger spreading scale. © 2022 IEEE.
ABSTRACT
Detecting the source of an outbreak cluster during a pandemic like COVID-19 can provide insights into the transmission process, associated risk factors, and help contain the spread. In this work we study the problem of source detection from multiple snapshots of spreading on an arbitrary network structure. We use a spatial temporal graph convolutional network based model (SD-STGCN) to produce a source probability distribution, by fusing information from temporal and topological spaces. We perform extensive experiments using popular compartmental simulation models over synthetic networks and empirical contact networks. We also demonstrate the applicability of our approach with real COVID-19 case data.
ABSTRACT
We study the epidemic source detection problem in contact tracing networks modeled as a graph-constrained maximum likelihood estimation problem using the susceptible-infected model in epidemiology. Based on a snapshot observation of the infection subgraph, we first study finite degree regular graphs and regular graphs with cycles separately, thereby establishing a mathematical equivalence in maximal likelihood ratio between the case of finite acyclic graphs and that of cyclic graphs. In particular, we show that the optimal solution of the maximum likelihood estimator can be refined to distances on graphs based on a novel statistical distance centrality that captures the optimality of the nonconvex problem. An efficient contact tracing algorithm is then proposed to solve the general case of finite degree-regular graphs with multiple cycles. Our performance evaluation on a variety of graphs shows that our algorithms outperform the existing state-of-the-art heuristics using contact tracing data from the SARS-CoV 2003 and COVID-19 pandemics by correctly identifying the superspreaders on some of the largest superspreading infection clusters in Singapore and Taiwan. IEEE